A Novel Decoding Algorithm for Reversible Variable Length Codes Based on the Massey Metric
نویسندگان
چکیده
The use of Variable Length Codes (VLC) to increase the coding efficiency based on the statistical characteristics of the data has long been employed in digital communication systems. However the catastrophic degradation of VLC encoded data which results from bit errors has led to the development of reversible variable length codes (RVLC) that can be decoded bidirectionally thereby having more efficient error resilient capabilities. Up to this point, no soft decoding algorithm for RVLC has been devised that effectively exploit the bidirectional characteristics of such codes. This paper introduces a novel decoding algorithm for reversible variable length codes that make use of the Massey metric while limiting the complexity of a purely unidirectional sequential decoder.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA Decoding Algorithm for Rank Metric Codes
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملOn Iterative Source-channel Decoding for Variable-length Encoded Markov Sources Using a Bit-level Trellis
In this paper we present a novel bit-level soft-input / softoutput decoding algorithm for variable-length encoded packetized Markov sources transmitted over wireless channels. An interesting feature of the proposed approach is that symbol-based source statistics in form of transition probabilities of the Markov source are exploited as a-priori information on a bit-level trellis. When additional...
متن کاملAlternant and BCH codes over certain rings
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of xs − 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore...
متن کامل